Evolving Winning Strategies for Nim-like Games

نویسنده

  • Mihai Oltean
چکیده

An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this paper. The winning strategy is computed by using the Multi Expression Programming (MEP) technique a fast and efficient variant of the Genetic Programming (GP). Each play strategy is represented by a mathematical expression that contains mathematical operators (such as +, -, *, mod, div, and , or, xor, not) and operands (encoding the current game state). Several numerical experiments for computing the winning strategy for the Nim game are performed. The computational effort needed for evolving a winning strategy is reported. The results show that the proposed evolutionary approach is very suitable for computing the winning strategy for Nim-like games.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TR-2005012: Propositional Games with Explicit Strategies

This paper presents a game semantics for LP, Artemov’s Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us to take a term t and an LP formula A and form the new formula t :A. We define a game semantics for this logic that interprets terms as winning strategies on the formulas they label, so t :A may be read as “t is a winning s...

متن کامل

Propositional games with explicit strategies

This paper presents a game semantics for LP, Artemov’s Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us to take a term t and an LP formula A and form the new formula t :A. We define a game semantics for this logic that interprets terms as winning strategies on the formulas they label, so t :A may be read as “t is a winning s...

متن کامل

Black&white Nim games

We present a new family of Nim games where the rules depend on a given ‘coloring’ of the tokens, each token being either black or white. The rules are as in Nim with the restriction that a white token on top of each heap is not allowed. We resolve the winning strategies of two disjoint game families played on two heaps. The heap-sizes with black tokens correspond to the numbers ⌊βn⌋, where β > ...

متن کامل

Conway Games, Coalgebraically

Using coalgebraic methods, we extend Conway’s original theory of games to include infinite games (hypergames). We take the view that a play which goes on forever is a draw, and hence rather than focussing on winning strategies, we focus on non-losing strategies. Infinite games are a fruitful metaphor for non-terminating processes, Conway’s sum of games being similar to shuffling. Hypergames hav...

متن کامل

Winning Strategies: The Emergence of Base 2 in the Game of Nim

Many players know that the secret to winning the game of Nim (and other “impartial” combinatorial games) is to write the sizes of the game’s piles in base 2 and then add them together without carry. The proof of this wellknown procedure (described below) is both straightforward and convincing. Nonetheless, the procedure still appears magical, as though a rabbit has been pulled out of a hat. Ast...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004